A Generalization of the Popov Criterion
نویسنده
چکیده
A criterion for the stability of control systems which contain an arbitrary jinik number oj memoryless nonlinearities is considered. The criterion is such that the degree oj stability may be specijied, and such that for the case when the absolute stability of a control system having one memoryless nonlinearity is considered, it reduces to the original Popov criterion. Introduction The formulation and proof of absolute stability criteria applicable to systems having many memoryless nonlinearities is given in (1) and (2). The significant contribution of (1) is the demonstration of the existence of a frequency response stability criterion for multiple nonlinearityy systems. The contribution of (2) is that means of constructing system Lyapunov functions are given. Also, the convenient application of the network theory concept of a positive real function to the control theory concept of a minimal realization of a transfer function (3) to proving the system stability criteria is indicated. However, consideration of the degree of stability of such systems is not given except in the single nonlinearity case (4). This paper gives an application of the theorem of (3) to establish a stability criterion for control systems containing an arbitrary finite number of memoryless nonlinearities that is more general than either of those considered in (1) and (2), and states clearly the conditions for which it maybe applied. The criterion is such that the degree of stability may be specified. When the absolute stability of a control system having one memoryless nonlinearity is considered, the criterion reduces to that given originally by Popov (5). Stability Criterion The nonlinear systems considered are those where the system is of the form (or may be arranged to be of the form) of that shown in Fig. 1. Lyapunov stability is considered, hence, the inputs are not indicated, The matrix ?$’(s) is an n X n matrix of stable rational transfer functions, assumed to be such that w(m) = o. (1) The nonlinearities ~i(~i) (i = 1,2, 0.., n) are assumed to satisfy the conditions O < ~i(~i)~i < kiyiz for ki>O(i=l,2, ”.., n). (2)
منابع مشابه
Strongly absolute stability of Lur ’ e type differential - algebraic systems ✩
In this paper, we consider Lur’e type differential-algebraic systems (LDS) and introduce the concept of strongly absolute stability. Such a notion is a generalization of absolute stability for Lur’e type standard state-space systems (LSS). By a Lur’e type Lyapunov function, we derive an LMI based stability criterion for LDS to be strongly absolutely stable. Using extended strictly positive real...
متن کاملProfit intensity criterion for transportation problems
In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...
متن کاملA Popov criterion for systems with slowly time-varying parameters
A Popov criterion is derived for systems with slowly timevarying parameters. The parameters and their time derivatives are assumed to take values in convex polytopes.
متن کاملLyapunov Functions for Generalized Discrete-Time Multivariable Popov Criterion
This paper shows the existence of Lur’e-Postkinov Lyapunov functions for the generalized multivariable discrete-time Popov criterion. The nonlinearities in the Lur’e system considered here are monotonic, sectorand slope-restricted. We discuss the cases where the nonlinearities are diagonal and non-diagonal. Our derivation is based on the discrete-time Kalman-Yakubovich-Popov (KYP) lemma and the...
متن کاملA Popov criterion for networked systems
We consider robustness analysis of heterogeneous and homogeneous networked systems based on integral quadratic constraints (IQCs). First, we show how the analysis decomposes into lower dimensional problems if the interconnection structure is exploited. This generally leads to a significant reduction of the computational complexity. Secondly, by considering a set of IQCs that characterizes the e...
متن کامل